منابع مشابه
Enumeration of M-partitions
An M-partition of a positive integer m is a partition of m with as few parts as possible such that every positive integer less than m can be written as a sum of parts taken from the partition. This type of partition is a variation of MacMahon’s perfect partition, and was recently introduced and studied by O’Shea, who showed that for half the numbers m, the number of M-partitions of m is equal t...
متن کاملEnumeration of Concave Integer Partitions
An integer partition λ ` n corresponds, via its Ferrers diagram, to an artinian monomial ideal I ⊂ C[x, y] with dimC C[x, y]/I = n. If λ corresponds to an integrally closed ideal we call it concave . We study generating functions for the number of concave partitions, unrestricted or with at most r parts. 1. concave partitions By an integer partition λ = (λ1, λ2, λ3, . . . ) we mean a weakly dec...
متن کاملEnumeration of Cylindric Plane Partitions
Résumé. Cylindric plane partitions may be thought of as a natural generalization of reverse plane partitions. A generating series for the enumeration of cylindric plane partitions was recently given by Borodin. As in the reverse plane partition case, the right hand side of this identity admits a simple factorization form in terms of the “hook lengths” of the individual boxes in the underlying s...
متن کاملEnumeration of Partitions with Hooklengths
Partitions of an integer have found extensive application in combinatorics [1, 14, 17], group representation theory [6, 13, 15], and the theory of algorithms [10, 12]. The component parts of a partition can be arranged linearly, in the plane or even associated with the elements of an arbitrary partially ordered set. One of the important properties of linear partitions is that their generating f...
متن کاملGraphical Basis Partitions
A partition of an integer n is graphical if it is the degree sequence of a simple undirected graph It is an open question whether the fraction of partitions of n which are graphical approaches as n approaches in nity A partition is basic if the number of dots in its Ferrers graph is minimum among all partitions with the same rank vector as In this paper we investigate graphical partitions via b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1980
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(80)80048-5